Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → a(b(c(a(x1))))
c(b(x1)) → a(b(a(x1)))

Q is empty.


QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → a(b(c(a(x1))))
c(b(x1)) → a(b(a(x1)))

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

C(b(x1)) → A(x1)
A(a(x1)) → A(b(c(a(x1))))
C(b(x1)) → A(b(a(x1)))
A(a(x1)) → C(a(x1))

The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → a(b(c(a(x1))))
c(b(x1)) → a(b(a(x1)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
QDP
      ↳ DependencyGraphProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(b(x1)) → A(x1)
A(a(x1)) → A(b(c(a(x1))))
C(b(x1)) → A(b(a(x1)))
A(a(x1)) → C(a(x1))

The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → a(b(c(a(x1))))
c(b(x1)) → a(b(a(x1)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
QDP
          ↳ Narrowing
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(b(x1)) → A(x1)
A(a(x1)) → C(a(x1))

The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → a(b(c(a(x1))))
c(b(x1)) → a(b(a(x1)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(a(x1)) → C(a(x1)) at position [0] we obtained the following new rules:

A(a(a(x0))) → C(a(b(c(a(x0)))))
A(a(x0)) → C(x0)



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
QDP
              ↳ QDPToSRSProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(b(x1)) → A(x1)
A(a(x0)) → C(x0)
A(a(a(x0))) → C(a(b(c(a(x0)))))

The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → a(b(c(a(x1))))
c(b(x1)) → a(b(a(x1)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The finiteness of this DP problem is implied by strong termination of a SRS due to [12].


↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
QTRS
                  ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → a(b(c(a(x1))))
c(b(x1)) → a(b(a(x1)))
C(b(x1)) → A(x1)
A(a(x0)) → C(x0)
A(a(a(x0))) → C(a(b(c(a(x0)))))

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(x1) → x1
a(a(x1)) → a(b(c(a(x1))))
c(b(x1)) → a(b(a(x1)))
C(b(x1)) → A(x1)
A(a(x0)) → C(x0)
A(a(a(x0))) → C(a(b(c(a(x0)))))

The set Q is empty.
We have obtained the following QTRS:

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))
b(C(x)) → A(x)
a(A(x)) → C(x)
a(a(A(x))) → a(c(b(a(C(x)))))

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
QTRS
                      ↳ DependencyPairsProof
                      ↳ QTRS Reverse
                      ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))
b(C(x)) → A(x)
a(A(x)) → C(x)
a(a(A(x))) → a(c(b(a(C(x)))))

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

A1(a(A(x))) → A1(c(b(a(C(x)))))
B(c(x)) → A1(x)
A1(a(A(x))) → B(a(C(x)))
B(c(x)) → B(a(x))
B(c(x)) → A1(b(a(x)))
A1(a(A(x))) → A1(C(x))
A1(a(x)) → A1(c(b(a(x))))
A1(a(x)) → B(a(x))

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))
b(C(x)) → A(x)
a(A(x)) → C(x)
a(a(A(x))) → a(c(b(a(C(x)))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
QDP
                          ↳ DependencyGraphProof
                      ↳ QTRS Reverse
                      ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A1(a(A(x))) → A1(c(b(a(C(x)))))
B(c(x)) → A1(x)
A1(a(A(x))) → B(a(C(x)))
B(c(x)) → B(a(x))
B(c(x)) → A1(b(a(x)))
A1(a(A(x))) → A1(C(x))
A1(a(x)) → A1(c(b(a(x))))
A1(a(x)) → B(a(x))

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))
b(C(x)) → A(x)
a(A(x)) → C(x)
a(a(A(x))) → a(c(b(a(C(x)))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 3 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
QDP
                              ↳ Narrowing
                      ↳ QTRS Reverse
                      ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

B(c(x)) → A1(x)
A1(a(A(x))) → B(a(C(x)))
B(c(x)) → B(a(x))
B(c(x)) → A1(b(a(x)))
A1(a(x)) → B(a(x))

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))
b(C(x)) → A(x)
a(A(x)) → C(x)
a(a(A(x))) → a(c(b(a(C(x)))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A1(a(A(x))) → B(a(C(x))) at position [0] we obtained the following new rules:

A1(a(A(y0))) → B(C(y0))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
QDP
                                  ↳ DependencyGraphProof
                      ↳ QTRS Reverse
                      ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

B(c(x)) → A1(x)
B(c(x)) → A1(b(a(x)))
B(c(x)) → B(a(x))
A1(a(A(y0))) → B(C(y0))
A1(a(x)) → B(a(x))

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))
b(C(x)) → A(x)
a(A(x)) → C(x)
a(a(A(x))) → a(c(b(a(C(x)))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
QDP
                                      ↳ Narrowing
                      ↳ QTRS Reverse
                      ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

B(c(x)) → A1(x)
B(c(x)) → B(a(x))
B(c(x)) → A1(b(a(x)))
A1(a(x)) → B(a(x))

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))
b(C(x)) → A(x)
a(A(x)) → C(x)
a(a(A(x))) → a(c(b(a(C(x)))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(c(x)) → A1(b(a(x))) at position [0] we obtained the following new rules:

B(c(x0)) → A1(b(x0))
B(c(a(x0))) → A1(b(a(c(b(a(x0))))))
B(c(a(A(x0)))) → A1(b(a(c(b(a(C(x0)))))))
B(c(A(x0))) → A1(b(C(x0)))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
QDP
                                          ↳ Narrowing
                      ↳ QTRS Reverse
                      ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

B(c(x)) → A1(x)
B(c(a(x0))) → A1(b(a(c(b(a(x0))))))
B(c(A(x0))) → A1(b(C(x0)))
B(c(a(A(x0)))) → A1(b(a(c(b(a(C(x0)))))))
B(c(x)) → B(a(x))
B(c(x0)) → A1(b(x0))
A1(a(x)) → B(a(x))

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))
b(C(x)) → A(x)
a(A(x)) → C(x)
a(a(A(x))) → a(c(b(a(C(x)))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A1(a(x)) → B(a(x)) at position [0] we obtained the following new rules:

A1(a(x0)) → B(x0)
A1(a(a(A(x0)))) → B(a(c(b(a(C(x0))))))
A1(a(A(x0))) → B(C(x0))
A1(a(a(x0))) → B(a(c(b(a(x0)))))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
QDP
                                              ↳ DependencyGraphProof
                      ↳ QTRS Reverse
                      ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A1(a(x0)) → B(x0)
B(c(x)) → A1(x)
B(c(a(x0))) → A1(b(a(c(b(a(x0))))))
B(c(a(A(x0)))) → A1(b(a(c(b(a(C(x0)))))))
B(c(A(x0))) → A1(b(C(x0)))
B(c(x)) → B(a(x))
B(c(x0)) → A1(b(x0))
A1(a(a(A(x0)))) → B(a(c(b(a(C(x0))))))
A1(a(a(x0))) → B(a(c(b(a(x0)))))
A1(a(A(x0))) → B(C(x0))

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))
b(C(x)) → A(x)
a(A(x)) → C(x)
a(a(A(x))) → a(c(b(a(C(x)))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
QDP
                                                  ↳ Narrowing
                      ↳ QTRS Reverse
                      ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A1(a(x0)) → B(x0)
B(c(x)) → A1(x)
B(c(a(x0))) → A1(b(a(c(b(a(x0))))))
B(c(A(x0))) → A1(b(C(x0)))
B(c(a(A(x0)))) → A1(b(a(c(b(a(C(x0)))))))
B(c(x)) → B(a(x))
B(c(x0)) → A1(b(x0))
A1(a(a(A(x0)))) → B(a(c(b(a(C(x0))))))
A1(a(a(x0))) → B(a(c(b(a(x0)))))

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))
b(C(x)) → A(x)
a(A(x)) → C(x)
a(a(A(x))) → a(c(b(a(C(x)))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(c(x)) → B(a(x)) at position [0] we obtained the following new rules:

B(c(A(x0))) → B(C(x0))
B(c(a(x0))) → B(a(c(b(a(x0)))))
B(c(a(A(x0)))) → B(a(c(b(a(C(x0))))))
B(c(x0)) → B(x0)



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
QDP
                                                      ↳ DependencyGraphProof
                      ↳ QTRS Reverse
                      ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

B(c(x)) → A1(x)
B(c(a(A(x0)))) → A1(b(a(c(b(a(C(x0)))))))
A1(a(a(A(x0)))) → B(a(c(b(a(C(x0))))))
A1(a(a(x0))) → B(a(c(b(a(x0)))))
B(c(a(A(x0)))) → B(a(c(b(a(C(x0))))))
A1(a(x0)) → B(x0)
B(c(a(x0))) → A1(b(a(c(b(a(x0))))))
B(c(A(x0))) → A1(b(C(x0)))
B(c(x0)) → A1(b(x0))
B(c(A(x0))) → B(C(x0))
B(c(a(x0))) → B(a(c(b(a(x0)))))
B(c(x0)) → B(x0)

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))
b(C(x)) → A(x)
a(A(x)) → C(x)
a(a(A(x))) → a(c(b(a(C(x)))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
                                                    ↳ QDP
                                                      ↳ DependencyGraphProof
QDP
                                                          ↳ Narrowing
                      ↳ QTRS Reverse
                      ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A1(a(x0)) → B(x0)
B(c(x)) → A1(x)
B(c(a(x0))) → A1(b(a(c(b(a(x0))))))
B(c(A(x0))) → A1(b(C(x0)))
B(c(a(A(x0)))) → A1(b(a(c(b(a(C(x0)))))))
B(c(x0)) → A1(b(x0))
B(c(a(x0))) → B(a(c(b(a(x0)))))
A1(a(a(A(x0)))) → B(a(c(b(a(C(x0))))))
B(c(a(A(x0)))) → B(a(c(b(a(C(x0))))))
A1(a(a(x0))) → B(a(c(b(a(x0)))))
B(c(x0)) → B(x0)

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))
b(C(x)) → A(x)
a(A(x)) → C(x)
a(a(A(x))) → a(c(b(a(C(x)))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(c(A(x0))) → A1(b(C(x0))) at position [0] we obtained the following new rules:

B(c(A(x0))) → A1(A(x0))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
                                                    ↳ QDP
                                                      ↳ DependencyGraphProof
                                                        ↳ QDP
                                                          ↳ Narrowing
QDP
                                                              ↳ DependencyGraphProof
                      ↳ QTRS Reverse
                      ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A1(a(x0)) → B(x0)
B(c(x)) → A1(x)
B(c(a(x0))) → A1(b(a(c(b(a(x0))))))
B(c(a(A(x0)))) → A1(b(a(c(b(a(C(x0)))))))
B(c(A(x0))) → A1(A(x0))
B(c(x0)) → A1(b(x0))
A1(a(a(A(x0)))) → B(a(c(b(a(C(x0))))))
B(c(a(x0))) → B(a(c(b(a(x0)))))
A1(a(a(x0))) → B(a(c(b(a(x0)))))
B(c(a(A(x0)))) → B(a(c(b(a(C(x0))))))
B(c(x0)) → B(x0)

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))
b(C(x)) → A(x)
a(A(x)) → C(x)
a(a(A(x))) → a(c(b(a(C(x)))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
                                                    ↳ QDP
                                                      ↳ DependencyGraphProof
                                                        ↳ QDP
                                                          ↳ Narrowing
                                                            ↳ QDP
                                                              ↳ DependencyGraphProof
QDP
                      ↳ QTRS Reverse
                      ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A1(a(x0)) → B(x0)
B(c(x)) → A1(x)
B(c(a(x0))) → A1(b(a(c(b(a(x0))))))
B(c(a(A(x0)))) → A1(b(a(c(b(a(C(x0)))))))
B(c(x0)) → A1(b(x0))
B(c(a(x0))) → B(a(c(b(a(x0)))))
A1(a(a(A(x0)))) → B(a(c(b(a(C(x0))))))
B(c(a(A(x0)))) → B(a(c(b(a(C(x0))))))
A1(a(a(x0))) → B(a(c(b(a(x0)))))
B(c(x0)) → B(x0)

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))
b(C(x)) → A(x)
a(A(x)) → C(x)
a(a(A(x))) → a(c(b(a(C(x)))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We have reversed the following QTRS:
The set of rules R is

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))
b(C(x)) → A(x)
a(A(x)) → C(x)
a(a(A(x))) → a(c(b(a(C(x)))))

The set Q is empty.
We have obtained the following QTRS:

a(x) → x
a(a(x)) → a(b(c(a(x))))
c(b(x)) → a(b(a(x)))
C(b(x)) → A(x)
A(a(x)) → C(x)
A(a(a(x))) → C(a(b(c(a(x)))))

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                      ↳ QTRS Reverse
QTRS
                      ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(b(c(a(x))))
c(b(x)) → a(b(a(x)))
C(b(x)) → A(x)
A(a(x)) → C(x)
A(a(a(x))) → C(a(b(c(a(x)))))

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))
b(C(x)) → A(x)
a(A(x)) → C(x)
a(a(A(x))) → a(c(b(a(C(x)))))

The set Q is empty.
We have obtained the following QTRS:

a(x) → x
a(a(x)) → a(b(c(a(x))))
c(b(x)) → a(b(a(x)))
C(b(x)) → A(x)
A(a(x)) → C(x)
A(a(a(x))) → C(a(b(c(a(x)))))

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                      ↳ QTRS Reverse
                      ↳ QTRS Reverse
QTRS
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(b(c(a(x))))
c(b(x)) → a(b(a(x)))
C(b(x)) → A(x)
A(a(x)) → C(x)
A(a(a(x))) → C(a(b(c(a(x)))))

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(x1) → x1
a(a(x1)) → a(b(c(a(x1))))
c(b(x1)) → a(b(a(x1)))

The set Q is empty.
We have obtained the following QTRS:

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
QTRS
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(x1) → x1
a(a(x1)) → a(b(c(a(x1))))
c(b(x1)) → a(b(a(x1)))

The set Q is empty.
We have obtained the following QTRS:

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse
QTRS

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(c(b(a(x))))
b(c(x)) → a(b(a(x)))

Q is empty.